KeyedIntTestObject result;

// Standard Java Map behavior
final Map<Integer, KeyedIntTestObject> map = new HashMap<>();
result = map.putIfAbsent(0, new KeyedIntTestObject(0));
assertNull(result);
assertFalse(map.replace(0, new KeyedIntTestObject(10), new KeyedIntTestObject(0)));
assertTrue(map.replace(0, new KeyedIntTestObject(0), new KeyedIntTestObject(10)));
    
// Our map, under normal conditions
final KeyedIntTestObjectMap m = new KeyedIntTestObjectMap(10);
result = m.putIfAbsent(0, new KeyedIntTestObject(0));
assertNull(result);

// This replace should fail, since we do not match old values
assertFalse(m.replace(0, new KeyedIntTestObject(10), new KeyedIntTestObject(0)));
// This returns true, although the value was NOT updated

KeyedIntTestObject result;

final KeyedIntTestObjectMap m = new KeyedIntTestObjectMap(10);

// Setup the conditions for the bug to be triggered
final int capacity = m.capacity();

// This will hash to 0 internally
result = m.putIfAbsent(capacity, new KeyedIntTestObject(capacity));
assertNull(result);

// This will also initially hash to 0, but will be double hashed to an empty slot
result = m.putIfAbsent(0, new KeyedIntTestObject(0));
assertNull(result);

// Remove the first object, leaving a DELETED tombstone at the 0 slot
result = m.remove(capacity);
assertNotNull(result);
assertEquals(result.getId(), capacity);

// This replace should fail, since we do not match old values. However, it succeeds
// and the value is updated.
assertFalse(m.replace(0, new KeyedIntTestObject(10), new KeyedIntTestObject(0)));